Stability of the path-path Ramsey number

نویسندگان

András Gyárfás

Gábor N. Sárközy

Endre Szemerédi

چکیده

Here we prove a stability version of a Ramsey-type Theorem for paths. Thus in any 2-coloring of the edges of the complete graph Kn we can either find a monochromatic path substantially longer than 2n/3, or the coloring is close to the extremal coloring.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The size Ramsey number of a directed path

Given a graph H, the size Ramsey number re(H, q) is the minimal number m for which there is a graph G with m edges such that every q-coloring of G contains a monochromatic copy of H. We study the size Ramsey number of the directed path of length n in oriented graphs, where no antiparallel edges are allowed. We give nearly tight bounds for every fixed number of colors, showing that for every q ≥...

متن کامل

Critical graphs for R(Pn, Pm) and the star-critical Ramsey number for paths

The graph Ramsey number R(G,H) is the smallest integer r such that every 2-coloring of the edges of Kr contains either a red copy of G or a blue copy of H. The star-critical Ramsey number r∗(G,H) is the smallest integer k such that every 2-coloring of the edges of Kr −K1,r−1−k contains either a red copy of G or a blue copy of H. We will classify the critical graphs, 2-colorings of the complete ...

متن کامل

Evaluation of Genotype × Environment Interaction in Chickpea Genotypes Using Path Analysis

Chickpea (Cicer arietinum L.) is one of the most important crops worldwide that is a subject of many plant breeding programs in many countries. In addition, climates are changing all over the world and drought becomes one of the most serious problems versus yield of crops. In order to screen drought tolerant genotype in Chickpea, twenty genotypes were tested under rainfed and irrigated...

متن کامل